Slicing Skew-tableau Frames
نویسندگان
چکیده
منابع مشابه
On the existence of partitionable skew Room frames
Partitionable skew Room frames of type hn have played an important role in the constructions of 4-frames, (K4 − e)-frames and super-simple (4, 2)-frames. In this paper, we investigate the existence of partitionable skew Room frames of type hn. The necessary conditions for the existence of such a design are that h(n − 1) ≡ 0 (mod 4) and h 5. It is proved that these necessary conditions are also ...
متن کاملTableau Recycling
In this paper we improve a model checking algorithm based on the tableau method of Stifling and Walker. The algorithm proves whether a property expressed in the modal mu-calculus holds for a state in a finite transition system. It makes subsequent use of subtableaux which were calculated earlier in the proof run. These aubtab|eaux are reduced to expressions. Examples show that both size of tabl...
متن کاملTableau Complexes
Let X, Y be finite sets and T a set of functions from X → Y which we will call “tableaux”. We define a simplicial complex whose facets, all of the same dimension, correspond to these tableaux. Such tableau complexes have many nice properties, and are frequently homeomorphic to balls, which we prove using vertex decompositions [BP79]. In our motivating example, the facets are labeled by semistan...
متن کاملOne Tableau Suffices
The grammars of any OT typology can be derived from a single tableau in which each row, when asserted as optimal, delivers the grammar of a language in the typology. In the single-tableau representation, each candidate represents an entire language. When, as is typically the case, a typology is constructed from more than one candidate set, a single tableau representation may be built from the M...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: European Journal of Combinatorics
سال: 1982
ISSN: 0195-6698
DOI: 10.1016/s0195-6698(82)80027-9